Nuprl Lemma : is-cr-input 11,40

es:ES, Config:AbsInterface(chain_config()), Cmd:Type, Sys:AbsInterface(chain_sys(Cmd)), e:E.
((e  Input))  (((e  Sys)) & valid-sys(es;Config;Sys;e) & (csinput?(Sys(e)))) 
latex


DefinitionsP  Q, let x,y = A in B(x;y), chain_sys(Cmd), AbsInterface(A), E, chain_config(), P & Q, xt(x), x.A(x), pred(e), <ab>, A, first(e), suptype(ST), S  T, Top, x:A.B(x), Void, x,yt(x;y), pred!(e;e'), , SWellFounded(R(x;y)), constant_function(f;A;B), b, , e < e', r  s, val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), , type List, Msg(M), kind(e), loc(e), Knd, kindcase(ka.f(a); l,t.g(l;t) ), EOrderAxioms(Epred?info), x:A  B(x), IdLnk, left + right, Unit, EqDecider(T), Type, P  Q, strong-subtype(A;B), , Id, f(a), a:A fp B(a), EState(T), ES, x:AB(x), x:AB(x), t  T, s = t, Input, (I|p), input-dcdr{i:l}(es;Cmd;Sys), Sys(valid), x  dom(f), (x  l), P  Q, A c B, cchead?(x), P  Q, cctail?(x), ccsucc?(x), e<e'.P(e), ccpred-id(x), e<e'P(e), ccpred?(x), (e <loc e'), True, Atom, inl x , tt, "$token", inr x , ff, csinput?(x), X(e), e  X, chain_sys_ind(x;cmd.input(cmd);from,cmds.update(from;cmds)), if b then t else f fi , case b of inl(x) => s(x) | inr(y) => t(y), t.1, E(X), {x:AB(x)} , valid-sys(es;Config;Sys;e)
Lemmases-E-interface wf, es-interface-val wf2, es-interface-val wf, csinput? wf, bfalse wf, btrue wf, true wf, valid-sys wf, ccpred? wf, es-locl wf, alle-lt wf, ccpred-id wf, existse-before wf, ccsucc? wf, cctail? wf, cchead? wf, rev implies wf, iff wf, es-is-interface wf, es-interface-restrict wf, input-dcdr wf, sys-valid wf, is-sys-valid, and functionality wrt iff, iff functionality wrt iff, es-is-interface-restrict, event system wf, subtype rel wf, EState wf, Id wf, rationals wf, member wf, strongwellfounded wf, pred! wf, unit wf, top wf, first wf, assert wf, not wf, loc wf, constant function wf, IdLnk wf, kindcase wf, Knd wf, bool wf, qle wf, cless wf, val-axiom wf, nat wf, Msg wf, kind wf, EOrderAxioms wf, deq wf, chain config wf, es-E wf, chain sys wf, es-interface wf

origin